A principled analysis of merging operations in possibilistic logic
نویسندگان
چکیده
Possibilistic logic offers a qualitative frame work for representing pieces of information associated with levels of uncertainty or pri ority. The fusion of multiple sources infor mation is discussed in this setting. Differ ent classes of merging operators are consid ered including conjunctive, disjunctive, rein forcement, adaptive and averaging operators. Then we propose to analyse these classes in terms of postulates. This is done by first ex tending the postulates for merging classical bases to the case where priorities are avail able.
منابع مشابه
A Comparison of Merging Operators in Possibilistic Logic
In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.
متن کاملMerging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation
Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and dealing with uncertainty. They often result in a possibilistic knowledge base which is a...
متن کاملA Model-based Approach for Merging Prioritized Knowledge Bases in Possibilistic Logic
This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propositional logic and the merged result of our approach is a normal possibility distribution. We also give an algorithm to obtain the syntactical counterpart of the semantic approach. The logical properties of our approach...
متن کاملMerging Interval-Based Possibilistic Belief Bases
In the last decade, several approaches were introduced in literature to merge multiple and potentially conflicting pieces of information. Within the growing field of application favourable to distributed information, data fusion strategies aim at providing a global and consistent point of view over a set of sources which can contradict each other. Moreover, in many situations, the pieces of inf...
متن کاملMerging Incommensurable Possibilistic DL-Lite Assertional Bases
This short paper studies the problem of merging of different independent data sources linked to a lightweight ontology under the incommensurability assumption. In general, data are often provided by several and potentially conflicting sources of information having different levels of priority. To encode prioritized assertional bases, we use possibilistic DLLite logic. We investigate an egalitar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000